RDFS(FA): Connecting RDF(S) and OWL DL
نویسندگان
چکیده
منابع مشابه
RDFS(FA): A DL-ised Sub-language of RDFS
Description Logics (DLs), as a field of research, form a formal foundation of first-order semantic Web ontology languages, such as DAML+OIL and OWL. The Semantic Web will build on XML’s ability to define customized tagging schemes and RDF(S)’s flexible approach to representing data. RDF Schema (RDFS), however, has a non-standard metamodeling architecture, which makes some elements in the model ...
متن کاملUsing SPARQL with RDFS and OWL Entailment
This chapter accompanies the lecture on SPARQL with entailment regimes at the 7th Reasoning Web Summer School in Galway, Ireland, 2011. SPARQL is a query language and protocol for data specified in the Resource Description Format (RDF). The basic evaluation mechanism for SPARQL queries is based on subgraph matching. The query criteria are given in the form of RDF triples possibly with variables...
متن کاملRDFS & OWL Reasoning for Linked Data
Linked Data promises that a large portion of Web Data will be usable as one big interlinked RDF database against which structured queries can be answered. In this lecture we will show how reasoning – using RDF Schema (RDFS) and the Web Ontology Language (OWL) – can help to obtain more complete answers for such queries over Linked Data. We first look at the extent to which RDFS and OWL features ...
متن کاملSPARQL-DL: SPARQL Query for OWL-DL
There are many query languages (QLs) that can be used to query RDF and OWL ontologies but neither type is satisfactory for querying OWL-DL ontologies. RDF-based QLs (RDQL, SeRQL, SPARQL) are harder to give a semantics w.r.t. OWL-DL and are more powerful than what OWL-DL reasoners can provide. DL-based QLs (DIG ask queries, nRQL) have clear semantics but are not powerful enough in the general ca...
متن کاملApproximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, we propose to recast the idea of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2007
ISSN: 1041-4347
DOI: 10.1109/tkde.2007.37